The determinacy of computation

A skeptical worry known as ‘the indeterminacy of computation’ animates much recent philosophical reflection on the computational identity physical systems. On one hand, explanation seems to require that computing systems fall under a single, unique description at time. other, if system falls any description, it many simultaneously. Absent some principled reason take just these descriptions in particular relevant for explanation, widespread failure would appear follow. This paper advances new solution computation. Very roughly, I argue is determinate relative contextually specified way regarding computationally—known labelling scheme. When simultaneously implements multiple computations, does so different schemes. But fixed scheme, has identity. this relativistic conception vindicates face simultaneous implementation.